Time-Indexed Relaxations for the Online Bipartite Matching Problem
نویسندگان
چکیده
We study the i.i.d. online bipartite matching problem, a dynamic version of the classical model where one side of the bipartition is fixed and known in advance, while nodes from the other side appear one at a time as i.i.d. realizations of an underlying distribution, and must immediately be matched or discarded. We consider time-indexed relaxations of the set of achievable matching probabilities, introduce complete subgraph inequalities, show how they theoretically dominate inequalities from a lower-dimensional relaxation presented in previous work, and discuss when they are facet-defining. We finally present a computational study to demonstrate the empirical quality of the new relaxations and the heuristic policies they imply.
منابع مشابه
A Polyhedral Approach to Online Bipartite Matching
We study the i.i.d. online bipartite matching problem, a dynamic version of the classical model where one side of the bipartition is fixed and known in advance, while nodes from the other side appear one at a time as i.i.d. realizations of a uniform distribution, and must immediately be matched or discarded. We consider various relaxations of the polyhedral set of achievable matching probabilit...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملOnline Bipartite Matching: A Survey and A New Problem
We study the problem of online bipartite matching, where algorithms have to draw irrevocable matchings based on an incomplete bipartite graph. Specifically, we focus on algorithms that maximize number of matchings (i.e. graphs with weight 0 or 1). First, competitive ratios of a well-studied problem (only one side of the bipartite graph is incomplete) with adversarial, random order and iid model...
متن کاملFinding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a family U of vertex subsets, a 2-matching F is called U-feasible if, for each U ∈ U , F contains at most |U | − 1 edges in the subgraph induced by U . Our framework includes C≤k-free 2-matchings, i.e., 2-matchings without cycles of at most k edges, and 2-factors covering prescribe...
متن کاملCse525: Randomized Algorithms and Probabilistic Analysis Lecture 8 1.1 Ranking Algorithm
1 Online bipartite matching Recall from last time we introduced the online bipartite matching problem and gave an algorithm to solve a fractional version of the problem with competitive ratio 1− 1/e. In the online bipartite matching problem, we are given a bipartite graph G = (L,R,E), where the vertices in R are revealed to us one at a time along with the edges from that vertex to L. Once each ...
متن کامل